Strong Belief and Weak Assumption
نویسنده
چکیده
Battigalli and Siniscalchi’s [Journal of Economic Theory 106, 356-391 (2002)] notion of “strong belief”in conditional probability systems and Yang’s [Journal of Economic Theory, forthcoming] notion of “weak assumption”in lexicographic probability systems are unified by the same requirements on preferences. Our analysis, hence, reconciles the tension between Battigalli and Siniscalchi’s characteriztion of extensive-form rationalizability and Brandenburger, Friedenberg, and Keisler’s [Econometrica 76, 307-352 (2008)] impossibility result.
منابع مشابه
Modeling of the beam discontinuity with two analyses in strong and weak forms using a torsional spring model
In this paper, a discontinuity in beams whose intensity is adjusted by the spring stiffness factor is modeled using a torsional spring. Adapting two analyses in strong and weak forms for discontinuous beams, the improved governing differential equations and the modified stiffness matrix are derived respectively. In the strong form, two different solution methods have been presented to make an a...
متن کاملModeling of the Beam Discontinuity with Two Analyses in Strong and Weak Forms using a Torsional Spring Model
In this paper, a discontinuity in beams whose intensity is adjusted by the spring stiffness factor is modeled using a torsional spring. Adapting two analyses in strong and weak forms for discontinuous beams, the improved governing differential equations and the modified stiffness matrix are derived respectively. In the strong form, two different solution methods have been presented to make an a...
متن کاملProjected Semi-Stochastic Gradient Descent Method with Mini-Batch Scheme under Weak Strong Convexity Assumption
We propose a projected semi-stochastic gradient descent method with mini-batch for improving both the theoretical complexity and practical performance of the general stochastic gradient descent method (SGD). We are able to prove linear convergence under weak strong convexity assumption. This requires no strong convexity assumption for minimizing the sum of smooth convex functions subject to a c...
متن کاملAn Online Boosting Algorithm with Theoretical Justifications
We study the task of online boosting — combining online weak learners into an online strong learner. While batch boosting has a sound theoretical foundation, online boosting deserves more study from the theoretical perspective. In this paper, we carefully compare the differences between online and batch boosting, and propose a novel and reasonable assumption for the online weak learner. Based o...
متن کاملStrong Completeness Theorems for Weak Logics of Common Belief
We show that several logics of common belief and common knowledge are not only complete, but also strongly complete, hence compact. These logics involve a weakened monotonicity axiom, and no other restriction on individual belief. The semantics is of the ordinary fixed-point type.
متن کامل